Quotient Evolutionary Space: Abstraction of Evolutionary process w.r.t macroscopic properties

نویسندگان

  • Ambedkar Dukkipati
  • Shalabh Bhatnagar
چکیده

Darwinian evolution, which is characterized in terms of particular macroscopic behavior that emerges from microscopic organismic interaction, considers populations as units of evolutionary change. We formalize these concepts in evolutionary computation by developing notion of quotient evolutionary space(Q.E.S). We map set of all finite populations to a set of macroscopic properties of population those are chosen a priori; and we call this mapping as evolutionary criteria. On the ‘quotient set of populations’ that is induced by evolutionary criteria, we define mathematical structures to define evolutionary change with respect to chosen macroscopic parameters at populational level. This allows us to transform the objective defined on the search space that is imposed by the fitness function to an objective on the population space. We call quotient set of populations along with the mathematical structures the quotient evolutionary space. To demonstrate the abstraction we consider fitness distribution of population as evolutionary criteria and give a detailed analysis of resulting spaces and basic convergence results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimating the Stationary Distributions of Markov Chains Modeling Evolutionary Algorithms using the “Quotient Construction” Method

The evolutionary algorithm stochastic process is well-known to be Markovian. These have been under investigation in much of the theoretical evolutionary computing research. When mutation rate is positive, the Markov chain modeling an evolutionary algorithm is irreducible and, therefore, has a unique stationary distribution, yet, rather little is known about the stationary distribution. In fact,...

متن کامل

How fast does the stationary distribution of the Markov chain modelling EAs concentrate on the homogeneous populations for small mutation rate?

One of the main difficulties faced when analyzing Markov chains modelling evolutionary algorithms is that their cardinality grows quite fast. A reasonable way to deal with this issue is to introduce an appropriate notion of a “coarse graining” or, in mathematical language, a quotient of such a Markov chain. The main topic of the current work is the construction of such a notion. We shell introd...

متن کامل

Approximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms

In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced‎. ‎In this approach‎, ‎first a discretized form of the time-control space is considered and then‎, ‎a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...

متن کامل

A NOVEL FUZZY MULTI-OBJECTIVE ENHANCED TIME EVOLUTIONARY OPTIMIZATION FOR SPACE STRUCTURES

This research presents a novel design approach to achieve an optimal structure established upon multiple objective functions by simultaneous utilization of the Enhanced Time Evolutionary Optimization method and Fuzzy Logic (FLETEO). For this purpose, at first, modeling of the structure design problem in this space is performed using fuzzy logic concepts. Thus, a new problem creates with functio...

متن کامل

Solving ‎‎‎Multi-objective Optimal Control Problems of chemical ‎processes ‎using ‎Hybrid ‎Evolutionary ‎Algorithm

Evolutionary algorithms have been recognized to be suitable for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier‎. ‎This paper applies an evolutionary optimization scheme‎, ‎inspired by Multi-objective Invasive Weed Optimization (MOIWO) and Non-dominated Sorting (NS) strategi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001